Computational hardness of spin-glass problems with tile-planted solutions
نویسندگان
چکیده
منابع مشابه
Detection of Planted Solutions for Flat Satisfiability Problems
We study the detection problem of finding planted solutions in random instances of flat satisfiability problems, a generalization of boolean satisfiability formulas. We describe the properties of random instances of flat satisfiability, as well of the optimal rates of detection of the associated hypothesis testing problem. We also study the performance of an algorithmically efficient testing pr...
متن کاملComputational Hardness of Enumerating Satisfying Spin-Assignments in Triangulations
Satisfying spin-assignments in triangulations of a surface are states of minimum energy of the antiferromagnetic Ising model on triangulations which correspond (via geometric duality) to perfect matchings in cubic bridgeless graphs. In this work we show that it is NP-complete to decide whether or not a surface triangulation admits a satisfying spin-assignment, and that it is #P-complete to dete...
متن کاملDynamical solutions of a quantum Heisenberg spin glass model
Abstract. We consider quantum-dynamical phenomena in the SU(2), S = 1/2 infinite-range quantum Heisenberg spin glass. For a fermionic generalization of the model we formulate generic dynamical selfconsistency equations. Using the Popov-Fedotov trick to eliminate contributions of the non-magnetic fermionic states we study in particular the isotropic model variant on the spin space. Two complemen...
متن کاملProtein Folding , Spin Glass and Computational Complexity 1
A reduction from \Ground State of Spin Glass" in statistical mechanics to a minimum-energy model of protein folding is made, which shows that the latter is NP-complete (high complexity). The reduction approximates true folding of a protein. The method also enables to show that even if the backbone of the protein is xed, the folding of the side-chains is NP-complete. In a separate second part, t...
متن کاملGraph-Theoretic Solutions to Computational Geometry Problems
Many problems in computational geometry are not stated in graphtheoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm depends on the special properties of the graph constructed in this way. We survey the art gallery problem, partition into rectangles, minimum-diameter clustering, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2020
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.101.023316